A comparison theorem of the improving Gauss-Seidel method for H-matrix and its comparison matrix
نویسنده
چکیده
for 12386 A Comparison Theorem of the Improving Gauss-Seidel method for H-matrix and its Comparison Matrix Authors: liying Sun, xingye xu Affiliations: Math Dept.of Guangdong Education Institute, Math Dept. of Guangdong Education Institute
منابع مشابه
Comparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملTrack : Presenting a talk with only an abstract
for 12386 A Comparison Theorem of the Improving Gauss-Seidel method for H-matrix and its Comparison Matrix Authors: liying Sun, xingye xu Affiliations: Math Dept.of Guangdong Education Institute, Math Dept. of Guangdong Education Institute
متن کاملConvergence and Comparison Theorems of the Modified Gauss-Seidel Method
In this paper, the modified Gauss-Seidel method with the new preconditioner for solving the linear system Ax = b, where A is a nonsingular M -matrix with unit diagonal, is considered. The convergence property and the comparison theorems of the proposed method are established. Two examples are given to show the efficiency and effectiveness of the modified Gauss-Seidel method with the presented n...
متن کاملSome Preconditioning Techniques for Linear Systems
New convergence intervals of parameters αi are derived and applied for solving the modified linear systems, which enables a better understanding of how parameters should be chosen. The convergence theorem for H-matrix is given. Meanwhile, we discuss the convergence results forM -matrices linear systems and give some new preconditioners. Numerical examples are used to illustrate our results. Key...
متن کاملExperiments with The Triangle Algorithm for Linear Systems ∗
We present some computational experimentation for solving a linear system Ax = b by applying the Triangle Algorithm described in [3], based on converting the system to a convex hull problem as described in [4]. A comparison of the performance with classical iterative methods such as Jacobi, Gauss-Seidel, and Successive Over-Relaxation method for small size problems suggests the Triangle Algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 183 شماره
صفحات -
تاریخ انتشار 2006